- coding theorems
- теоремы кодирования
Англо-русский словарь по вычислительной технике и информационным технологиям - 4-е изд.. Сергей Орлов .
coding theorems
Смотреть что такое "coding theorems" в других словарях:
Coding theory approaches to nucleic acid design — DNA code construction refers to the application of coding theory to the design of nucleic acid systems for the field of DNA–based computation. Contents 1 Introduction 2 Definitions 2.1 Property U 2 … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Distributed source coding — (DSC) is an important problem in information theory and communication. DSC problems regard the compression of multiple correlated information sources that do not communicate with each other.[1] By modeling the correlation between multiple sources … Wikipedia
Noisy-channel coding theorem — In information theory, the noisy channel coding theorem (sometimes Shannon s theorem), establishes that for any given degree of noise contamination of a communication channel, it is possible to communicate discrete data (digital information)… … Wikipedia
Information theory — Not to be confused with Information science. Information theory is a branch of applied mathematics and electrical engineering involving the quantification of information. Information theory was developed by Claude E. Shannon to find fundamental… … Wikipedia
Jacob Wolfowitz — (* 19. März 1910 in Warschau; † 16. Juli 1981 in Tampa) war ein aus Polen in die Vereinigten Staaten emigrierter Statistiker und Informationstheoretiker. Sein Sohn ist der amerikanische Politiker Paul Wolfowitz. Jacob Wolfowitz 1970 … Deutsch Wikipedia
Grammar-based code — Grammar based codes are compression algorithms based on the idea of constructing a context free grammar for the string to be compressed. Examples include universal lossless data compression algorithms proposed in Kieffer and Yang 2000, and… … Wikipedia
Jacob Wolfowitz — Jacob Wolfowitz, Ph.D. (March 19, 1910 ndash; July 16, 1981) was a Polish born American statistician and Shannon Award winning information theorist. He was the father of former Deputy Secretary of Defense and World Bank Group President Paul… … Wikipedia
Repeat-accumulate code — In computer science, repeat accumulate codes (RA codes) are a low complexity class of error correcting codes. They were devised so that their ensemble weight distributions are easy to derive. RA codes were introduced by Divsalar et al. In an RA… … Wikipedia
Alexander Cholewo — Alexander Semjonowitsch Cholewo (russisch Александр Семёнович Холево, englische Transliteration Alexander Semyonovich Kholevo oder Holevo; * 2. September 1943 in Moskau) ist ein russischer Mathematiker und mathematischer Physiker. Alexander… … Deutsch Wikipedia
Alexander Holevo — Alexander Semjonowitsch Cholewo (russisch Александр Семёнович Холево, englische Transliteration Alexander Semyonovich Kholevo oder Holevo; * 2. September 1943 in Moskau) ist ein russischer Mathematiker und mathematischer Physiker. Alexander… … Deutsch Wikipedia
